On the Timing of Labeling: Deducing Comp-trace Effects, the Subject Condition, the Adjunct Condition, and Tucking in from Labeling

نویسندگان

  • Željko Bošković
  • Yoshiyuki Shibata
چکیده

The paper provides a uniform account of a number of locality effects, in particular, the Subject Condition, the Adjunct Condition, Richards’s (2001) tucking in effect, and the full Comp-trace paradigm, including (in addition to the basic cases) relative and extraposed clauses, the impossibility of short-subject topicalization, French que-qui alternation, and the effect of whmovement on agreement in languages like Kinande, which is discussed in some detail. The account is based on a proposal that there is a difference in the timing of labeling between the basic case where a head and a phrase merge and the case where two phrases merge, as well as a particular labeling-based approach to antilocality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization condition in labeling of Ofloxacin with 99mTc and its biological evaluation in Staphylococcus aureus and Escherichia coli for infection imaging

Introduction: The use of radiopharmaceuticals is a powerful tool in the management of patients with infectious or inflammatory diseases in nuclear medicine. In this study ofloxacin as a second-generation fluoroquinolone is used to design a desired infection imaging agent after labeling with 99mTc via direct labeling. Methods: Ofloxacin was radiolabeled with 99mTc using di...

متن کامل

Totally magic cordial labeling of some graphs

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

متن کامل

On (Semi-) Edge-primality of Graphs

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

متن کامل

The labeling of platelet with Tc-99m and In-111 [Persian]

We separated platelets from whole blood and incorporated them into In-Ill and Te-99m agents. Sn-GHA, Tropolone, Oxine (sulphate) and HMPAO were used to diffuse radionuclides into the platelets. The effects of time, temperature, PH of incubation media; volume and concentration of ionophore; and volume and activity of ln-l 13m C13 and Te-99m on labeling efficiency were studied.

متن کامل

Terminology of Combining the Sentences of Farsi Language with the Viterbi Algorithm and BI-GRAM Labeling

This paper, based on the Viterbi algorithm, selects the most likely combination of different wording from a variety of scenarios. In this regard, the Bi-gram and Unigram tags of each word, based on the letters forming the words, as well as the bigram and unigram labels After the breakdown into the composition or moment of transition from the decomposition to the combination obtained from th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015